decoding complexity造句
例句與造句
- Designing codes with approaching shannon ' s capacity performance and low coding and decoding complexity is a challenging and meaningful issue in channel coding field
設(shè)計(jì)性能逼近信道容量、編譯碼復(fù)雜度較低的實(shí)用好碼是信道編碼領(lǐng)域中最重要的工作之一。 - Turbo code was introduced by c . berrou in 1993 . turbo code can achieve the error correcting capacity close to the shannon - limit with reasonable decoding complexity , provided that the code words are long enough
1993年, c . berrou提出了一種新的信道編碼方案? ? turbo碼, turbo碼能夠在編碼長(zhǎng)度較長(zhǎng)的情況下得到接近香農(nóng)極限的糾錯(cuò)性能。 - Its decoding complexity is also lower than turbo code . recently , ldpc code has drawn the worldwide attentions in channel coding community due to its high performance and strong potential applications in practice
Ldpc碼的數(shù)學(xué)定義非常簡(jiǎn)單,具有較大的靈活性,當(dāng)碼長(zhǎng)足夠長(zhǎng)時(shí)的非正規(guī)ldpc碼具有比turbo碼更為良好的性能,其譯碼復(fù)雜度低于turbo碼。 - Low density parity check ( ldpc ) codes are shown to be one class of shannon limit approaching codes . with advantages of high encoding gain , low decoding complexity and flexible code rates , etc . , the research of these codes has become a hot spot of coding academia
低密度校驗(yàn)碼( ldpc )性能接近香農(nóng)限,具有編碼增益高、譯碼簡(jiǎn)單快捷、碼率靈活等優(yōu)點(diǎn),是當(dāng)前編碼界的研究熱點(diǎn)。 - 3 . by theoretical analysis and simulation , quantization decoding of ldpc codes is studied . an efficient quantization - decoding scheme is proposed which can greatly reduce the decoding complexity with a little performance loss
采用理論分析和仿真相結(jié)合的方法研究了ldpc碼的量化譯碼，提出了一種高效的量化譯碼實(shí)現(xiàn)方案，該方案能夠大大降低譯碼復(fù)雜度，同時(shí)譯碼性能非常接近連續(xù)譯碼。 - It's difficult to find decoding complexity in a sentence. 用decoding complexity造句挺難的
- Erasure codes which belong to standard classes of rs codes and their erasure correcting principles are introduced with emphasis on cascaded low - density erasure codes with linear time encoding and erasure recover algorithms . the encoding and decoding complexities of these codes are analyzed . 2
介紹了標(biāo)準(zhǔn)的rs碼類糾刪碼及其糾刪原理，重點(diǎn)介紹了具有線性時(shí)間編碼和恢復(fù)算法的漸近好碼?級(jí)聯(lián)型低密度糾刪碼，分析了這幾類糾刪碼的編譯碼復(fù)雜度； 2 - Space - time block codes ( stbc ) based on orthogonal design has attracts enough attentions in its applications in mimo - ofdm systems for its full diversity exploiting and low coding / decoding complexity . these applications include not only system performance improvement , but also reduction of the peak to average power ratio in mimo - ofdm systems . under these backgrounds , this paper first studies space - time block codes under the single carrier , flat fading situation , discusses the encoding / decoding principle and its performance under different channels . then , the author focused on the performance of space - time codes under time selective and frequency selective channels , uncovered the fundamental cause of how maximum doppler shift and power delay profile influences the performance of space - time codes through deduction and simulation
在上述背景下,本文以單載波,平坦衰落信道下的空時(shí)分組碼為切入點(diǎn),深入分析了其編譯碼原理和在不同信道情況下的性能;以此為基礎(chǔ),后文展開了對(duì)空時(shí)分組碼在多載波,時(shí)間選擇性和頻率選擇性衰落信道下的性能研究,通過理論推導(dǎo)和充分的仿真,揭示了空時(shí)/頻分組碼在時(shí)頻選擇性衰落信道中的性能變化的根本原因;在以上對(duì)多載波系統(tǒng)中空時(shí)分組碼的研究的過程中,作者發(fā)現(xiàn)了空時(shí)分組碼在降低系統(tǒng)峰平比方面應(yīng)用的可行性,提出了一種降低峰平比的新方法。 - In this paper , the constraint viterbi algorithm is studied from the project research on a novel product code and decode which is a project of national natural science foundation of china , experiment results show that it can overcome the drawback and reduce the decoding complexity while keeping the good characteristic of conventional viterbi algorithm
本文所研究的約束維特比算法基于國(guó)家科學(xué)基金項(xiàng)目《新一代乘積編碼( productcode )及解碼方法的研究》 ,不但保持了原有維特比算法的特性,而且在減少譯碼路徑的情況下,能較好地解決上述問題。